On disjoint sets of distribution functions

On Disjoint Sets of Differences

must hold, where A(x) denotes the number of elements of A up to x. It is quite natural to ask how much the situation changes if we cut A into two parts, A' and A ", and demand only that no a i' a, should coincide with any a i ' -a,' . This question was proposed by Erdős and Graham in [2], and it seemed likely that no considerable increase can be achieved in the density of A . We shall show, how...

study of hash functions based on chaotic maps

توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...

On Pre-θ-Open Sets and Two Classes of Functions

The Distribution of Values of Analytic Functions on Convex Sets

Proceeding the study of local properties of analytic functions started in [Br] we prove new dimensionless inequalities for such functions in terms of their Chebyshev degree. As a consequence we obtain the reverse Hölder inequalities for analytic functions with absolute (i.e., independent of dimension) constants. For polynomials such inequalities were recently proved by Bobkov who sharpened and ...

On Crossing Sets, Disjoint Sets and the Pagenumber 1

Let G = (V;E) be a t-partite graph with n vertices and m edges, where the partite sets are given. We present an O(n2m1:5) time algorithm to construct drawings of G in the plane so that the size of the largest set of pairwise crossing edges, and at the same time, the size of the largest set of disjoint (pairwise non-crossing) edges are O(pt m). As an application we embed G in a book of O(pt m) p...